Resource Allocation in Cloud Computing Using Imperialist Competitive Algorithm with Reliability Approach
نویسندگان
چکیده
Cloud computing has become a universal trend now. So, for users, the reliability is an effective factor to use this technology. In addition, users prefer to implement and get their work done quickly. This paper takes into account these two parameters for resource allocation due to their importance In this method, the Imperialist Competitive algorithm with the addition of a cross layer of cloud architecture to reliability evaluation is used. In this cross layer, initial reliability is considered for all the resources and the implementation of their tasks and due to the success or failure of implementation, reliability of resources is increased or reduced. Reliability and makespan are used as a cost function in ICA for resource allocation. Results show that the proposed method can search the problem space in a better manner and give a better performance when compared to other methods. Keywords—Imperialist Competitive algorithm; Reliability; makespan; Cloud Computing
منابع مشابه
The Comparison of Imperialist Competitive Algorithm Applied and Genetic Algorithm for Machining Allocation of Clutch Assembly (TECHNICAL NOTE)
The allocation of design tolerances between the components of a mechanical assembly and manufacturing tolerances can significantly affect the functionality of products and related production costs. This paper introduces Imperialist Competitive Algorithm (ICA) approach to solve the machining tolerance allocation of an overrunning clutch assembly. The objective is to obtain optimum tolerances of...
متن کاملIntegrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment
Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...
متن کاملEfficient Data Mining with Evolutionary Algorithms for Cloud Computing Application
With the rapid development of the internet, the amount of information and data which are produced, are extremely massive. Hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. Data mining can overcome this problem. While data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. As the speed of ...
متن کاملFRA-PSO: A two-stage Resource Allocation Algorithm in Cloud Computing
Cloud computing gives a large quantity of processing possibilities and heterogeneous resources, meeting the prerequisites of numerous applications at diverse levels. Therefore, resource allocation is vital in cloud computing. Resource allocation is a technique that resources such as CPU, RAM, and disk in cloud data centers are divided among cloud users. The resource utilization, cloud service p...
متن کاملSolving a Redundancy Allocation Problem by a Hybrid Multi-objective Imperialist Competitive Algorithm
A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective functi...
متن کامل